Verifying context-sensitive treebanks and heuristic parses in polynomial time
نویسنده
چکیده
A polyadic dynamic logic is introduced in which a model-theoretic version of nonlocal multicomponent tree-adjoining grammar can be formulated. It is shown to have a low polynomial time model checking procedure. This means that treebanks for nonlocal MCTAG, incl. all weaker extensions of TAG, can be efficiently corrected and queried. Our result is extended to HPSG treebanks (with some qualifications). The model checking procedures can also be used in heuristics-based parsing.
منابع مشابه
splitSVM: Fast, Space-Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications
We present a fast, space efficient and nonheuristic method for calculating the decision function of polynomial kernel classifiers for NLP applications. We apply the method to the MaltParser system, resulting in a Java parser that parses over 50 sentences per second on modest hardware without loss of accuracy (a 30 time speedup over existing methods). The method implementation is available as th...
متن کاملIterative Treebank Refinement
Treebanks are a valuable resource for the training of parsers that perform automatic annotation of unseen data. It has been shown that changes in the representation of linguistic annotation have an impact on the performance of a certain annotation task. We focus on the task of Topological Field Parsing for German using Probabilistic Context-Free Grammars in the present research. We investigate ...
متن کاملDependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound
We present a novel dependency parsing method which enforces two structural properties on dependency trees: bounded block degree and well-nestedness. These properties are useful to better represent the set of admissible dependency structures in treebanks and connect dependency parsing to context-sensitive grammatical formalisms. We cast this problem as an Integer Linear Program that we solve wit...
متن کاملRegular Approximation as a Heuristics for A* Parsing
Parsing probabilistic context-free grammars generated from treebanks can be made more efficient by employing heuristics to reduce the search space. Klein and Manning (2003) applied A* search to parsing and achieved a huge efficiency gain using several search estimates which rely on grammar transformation and context summaries. We review ideas that have been published and propose a new estimate ...
متن کاملA Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem
A clique in an undirected graph G= (V, E) is a subset V ' ⊆ V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph. The clique problem is NP-Complete. We have succeeded in developing a fast algorithm for maximum clique problem by employing the method of verification and elimination. For a graph o...
متن کامل